FURS: Fast and Unique Representative Subset selection retaining large-scale community structure
نویسندگان
چکیده
منابع مشابه
varbvs: Fast Variable Selection for Large-scale Regression
We introduce varbvs, a suite of functions written in R and MATLAB for regression analysis of large-scale data sets using Bayesian variable selection methods. We have developed numerical optimization algorithms based on variational approximation methods that make it feasible to apply Bayesian variable selection to very large data sets. With a focus on examples from genome-wide association studie...
متن کاملGenoCore: A simple and fast algorithm for core subset selection from large genotype datasets
Selecting core subsets from plant genotype datasets is important for enhancing cost-effectiveness and to shorten the time required for analyses of genome-wide association studies (GWAS), and genomics-assisted breeding of crop species, etc. Recently, a large number of genetic markers (>100,000 single nucleotide polymorphisms) have been identified from high-density single nucleotide polymorphism ...
متن کاملFeature subset selection in large dimensionality domains
Article history: Received 30 January 2009 Received in revised form 31 May 2009 Accepted 17 June 2009
متن کاملStability analysis and selection of optimuim support system of large scale underground space-Case study
The Azad pumped storage power plant including the pumping and transformer cavern and surge tanks has been located in the Sanandaj-Sirjan formation with the alternation of slate and phyllite and meta sandstone.Due to the sensitivity and special use of these spaces, stability analysis and ensuring the safety of carven is very important.Nowadays, using the surface storage tanks is very costly; The...
متن کاملConvex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit algorithms such as subspace pursuit (SP), the proposed algorithm has a convex formulation and guarantees that the objective value can be monotonically decreased. Moreover, theoretical analysis and experimental results sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Network Analysis and Mining
سال: 2013
ISSN: 1869-5450,1869-5469
DOI: 10.1007/s13278-013-0144-6